package sword;

/**
 * @Author: 海琳琦
 * @Date: 2022/6/6 16:55
 * https://leetcode.cn/problems/zui-chang-bu-han-zhong-fu-zi-fu-de-zi-zi-fu-chuan-lcof/
 */
public class Title48 {

    /**
     * dp[i]表示当前索引为i时不包含重复字符子字符串的长度
     * @param s
     * @return
     */
    public int lengthOfLongestSubstring(String s) {
        int n = s.length();
        int[] dp = new int[n];
        return -1;
    }

    public static void main(String[] args) {

    }
}
